Efficient Algorithms for Approximating Polygonal Chains

Efficient Algorithms for Approximating Polygonal Chains

We consider the problem of approximating a polygonal chain C by another polygonal chain C ′ whose vertices are constrained to be a subset of the set of vertices of C . The goal is to minimize the number of vertices needed in the approximation C ′. Based on a framework introduced by Imai and Iri [25], we define an error criterion for measuring the quality of an approximation. We consider two pro...

Search algorithms for efficient logistics chains

Logistics networks arise whenever there is a transfer of material substance or objects (such as checked baggage on international flights) as well as energy, information, or finance through links (channels). A general concept of logistics network is suggested and motivated for modeling a service of any kind supplied through links between the nodes of the network. The efficiency of a single link ...

Approximating Polygonal Objects by Deformable Smooth Surfaces

We propose a method to approximate a polygonal object by a deformable smooth surface, namely the t-skin defined by Edelsbrunner [5] for all 0 < t < 1. We guarantee that they are homeomorphic and their Hausdorff distance is at most > 0. This construction make it possible for fully automatic, smooth and robust deformation between two polygonal objects with different topologies. En route to our re...

Approximating NP-hard Problems Efficient Algorithms and their Limits

Algorithms for Approximating Minimization Problems

In this paper, we study the following minimization problem